On the ubiquity of certain total type structures

نویسنده

  • John Longley
چکیده

It is a fact of experience from the study of higher type computability that a wide range of approaches to defining a class of (hereditarily) total functionals over N leads in practice to a relatively small handful of distinct type structures. Among these are the type structure C of Kleene-Kreisel continuous functionals, its effective substructure C, and the type structure HEO of the hereditarily effective operations. However, the proofs of the relevant equivalences are often non-trivial, and it is not immediately clear why these particular type structures should arise so ubiquitously. In this paper we present some new results which go some way towards explaining this phenomenon. Our results show that a large class of extensional collapse constructions always give rise to C, C or HEO (as appropriate). We obtain versions of our results for both the “standard” and “modified” extensional collapse constructions. The proofs make essential use of a technique due to Normann. Many new results, as well as some previously known ones, can be obtained as instances of our theorems, but more importantly, the proofs apply uniformly to a whole family of constructions, and provide strong evidence that the above three type structures are highly canonical mathematical objects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explorer On the Ubiquity of Certain Total Type Structures : ( Extended

We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin’s language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for...

متن کامل

On the Ubiquity of Certain Total Type Structures: (Extended Abstract)

We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it. In each case, we present an extension of Plotkin’s language FPC (or a suitable linearization thereof) which defines all computable strategies of appropriate types. The quest for such languages results in a novel selection of language primitives for...

متن کامل

Blood groups: In Health and Diseases

ABO blood type antigens are polymorphic, inherited structures presented on the surface of red blood cells. Although ABO blood group antigens is the most important antigens in transfusion medicine, its main role is not clearly clarified. Correlation between ABO blood group and susceptibility to certain infectious and non-infectious diseases is a controversial issue. Since, lack of blood type ant...

متن کامل

Detection of Polymer Brushes developed via Single Crystal Growth

Single crystals consisting various surface morphologies and epitaxial structures were applied to investigate the effect of other phase regions in the vicinity of a given tethered chains-covered area having a certain molecular weight of amorphous brushes. The designed experiments demonstrated that regardless of the type of surface morphology (patterned and especial mixed-brushes, homo and co...

متن کامل

An intrinsic treatment of ubiquity phenomena in higher-order computability models

We introduce some simple conditions on typed partial combinatory algebras (viewed as models of higher-order computability) which suffice for an axiomatic development of some non-trivial computability theory, including various forms of the Kreisel-LacombeShoenfield theorem, along with the author’s earlier ‘ubiquity’ theorems which say that a wide range of computability models all give rise to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2007